Generalized Scalarizing Model GENS in DSS WebOptim

نویسندگان

  • Leoneed Kirilov
  • Vassil Guliashki
  • Krassimira Genova
  • Mariana Vassileva
  • Boris Staykov
چکیده

A web-based Decision Support System WebOptim for solving multiple objective optimization problems is presented. Its basic characteristics are: user-independent, multisolver-admissibility, method-independent, heterogeneity, web-accessibility. Core system module is an original generalized interactive scalarizing method. It incorporates a number of thirteen interactive methods. Most of the known scalarizing approaches (reference point approach, reference direction approach, classification approach etc.) could be used by changing the method’s parameters. The Decision Maker (DM) can choose the most suitable for him/her form for setting his/her preferences: objective weights, aspiration levels, aspiration directions, aspiration intervals. This information could be changed interactively by the DM during the solution process. Depending on the DM’s preferences form the suitable scalarizing method is chosen automatically. In this way the demands on the DM’s knowledge and experience in the optimization methods area are minimized. Generalized Scalarizing Model GENS in DSS WebOptim

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized Scalarizing Problems Gens and Genslex of Multicriteria Optimization1

Generalized scalarizing problems, called GENS and GENSLex, for obtaining Pareto optimal solutions of multicriteria optimization problems are presented in the paper. The basic properties of these scalarizing problems are described. The existence of single-criterion problems with differentiable objective functions and constraints, which are equivalent to GENS and GENSLex scalarizing problems, are...

متن کامل

Generalized Erdos Numbers for network analysis

In this paper we consider the concept of ‘closeness’ between nodes in a weighted network that can be defined topologically even in the absence of a metric. The Generalized Erdős Numbers (GENs) [1] satisfy a number of desirable properties as a measure of topological closeness when nodes share a finite resource between nodes as they are real-valued and non-local, and can be used to create an asym...

متن کامل

Methods for multi-objective optimization: An analysis

Decomposition-based methods are often cited as the solution to multi-objective nonconvex optimization problems with an increased number of objectives. These methods employ a scalarizing function to reduce the multi-objective problem into a set of single objective problems, which upon solution yield a good approximation of the set of optimal solutions. This set is commonly referred to as Pareto ...

متن کامل

Practical common weights scalarizing function approach for efficiency analysis

A characteristic of Data Envelopment Analysis (DEA) is to allow individual decision making units (DMUs) to select the factor weights which are the most advantageous for them in calculating their efficiency scores. This flexibility in selecting the weights, on the other hand, deters the comparison among DMUs on a common base. For dealing with this difficulty and assessing all the DMUs on the sam...

متن کامل

Decoupled Vector-Fetch Architecture with a Scalarizing Compiler

Decoupled Vector-Fetch Architecture with a Scalarizing Compiler

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IJDSST

دوره 5  شماره 

صفحات  -

تاریخ انتشار 2013